An asymptotic formula for the number of irreducible transformation shift registers
نویسندگان
چکیده
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short proof for the exact number of irreducible transformation shift registers of order two using a recent generalization of a theorem of Carlitz.
منابع مشابه
On the determination of asymptotic formula of the nodal points for the Sturm-Liouville equation with one turning point
In this paper, the asymptotic representation of the corresponding eigenfunctions of the eigenvalues has been investigated. Furthermore, we obtain the zeros of eigenfunctions.
متن کاملClock-Controlled Shift Registers for Key-Stream Generation
In this paper we estimate the period of the sequence generated by a clock-controlled LFSR with an irreducible feedback polynomial and an arbitrary structure of the control sequence, as well as some randomness properties of this sequence including element distribution and the autocorrelation function. Also we construct and analyze a specific key-stream generator that applies clock-control. Final...
متن کاملDeciding Irreducibility/Indecomposability of Feedback Shift Registers is NP-hard
Feedback shift registers(FSRs) are a fundamental component in electronics and secure communication. An FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g has less memory than f . An FSR is said to be decomposable if it has the same set of output sequences as a cascade connection of two FSRs. It is proved that deciding whether FSRs...
متن کاملAn Asymptotic Formula for the Number of Smooth Values of a Polynomial
Integers without large prime factors, dubbed smooth numbers, are by now firmly established as a useful and versatile tool in number theory. More than being simply a property of numbers that is conceptually dual to primality, smoothness has played a major role in the proofs of many results, from multiplicative questions to Waring’s problem to complexity analyses of factorization and primality-te...
متن کاملMonomial Irreducible sln-Modules
In this article, we introduce monomial irreducible representations of the special linear Lie algebra $sln$. We will show that this kind of representations have bases for which the action of the Chevalley generators of the Lie algebra on the basis elements can be given by a simple formula.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1506.02548 شماره
صفحات -
تاریخ انتشار 2015